$\mathcal{T}$ measure of Cartesian product sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alliance free sets in Cartesian product graphs

Let G = (V,E) be a graph. For a non-empty subset of vertices S ⊆ V , and vertex v ∈ V , let δS(v) = |{u ∈ S : uv ∈ E}| denote the cardinality of the set of neighbors of v in S, and let S = V − S. Consider the following condition: δS(v) ≥ δS(v) + k, (1) which states that a vertex v has at least k more neighbors in S than it has in S. A set S ⊆ V that satisfies Condition (1) for every vertex v ∈ ...

متن کامل

Packing Dimension, Hausdorff Dimension and Cartesian Product Sets

We show that the dimension adim introduced by R. Kaufman (1987) coincides with the packing dimension Dim, but the dimension aDim introduced by Hu and Taylor (1994) is different from the Hausdorff dimension. These results answer questions raised by Hu and Taylor. AMS Classification numbers: Primary 28A78, 28A80.

متن کامل

On unique minimum dominating sets in some Cartesian product graphs

Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

Cartesian Product of Functions

For simplicity we follow the rules: x, y, y1, y2, z, a will be arbitrary, f , g, h, h′, f1, f2 will denote functions, i will denote a natural number, X, Y , Z, V1, V2 will denote sets, P will denote a permutation of X, D, D1, D2, D3 will denote non-empty sets, d1 will denote an element of D1, d2 will denote an element of D2, and d3 will denote an element of D3. We now state a number of proposit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1975

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1975-0367162-1